A Direct Trust Aggregation Algorithm Based on the Minimum Variance Time Sequence Weight

نویسنده

  • Li Qiang
چکیده

Direct trust relationship is the foundation of research on the indirect recommendation trust between agents and the global trust degree. In view of the lack of analysis and attention on the direct trust in the current research of dynamic trust relationship, this paper proposes a minimum variance time sequence weight based direct trust aggregation algorithm which is constrained by the fuzzy integration operator orness measurement level. The algorithm introduces the concept of agent reputation, elaborates the evolution process and the law of the trust in the process of direct interaction, and further characterizes the complexity and stability of direct trust relationship. The simulation experimental results show that the model has a good dynamic adaptability and scalability compared with the conventional model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GGRA: a grouped gossip-based reputation aggregation algorithm

An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...

متن کامل

A confidence-aware interval-based trust model

It is a common and useful task in a web of trust to evaluate the trust value between two nodes using intermediate nodes. This technique is widely used when the source node has no experience of direct interaction with the target node, or the direct trust is not reliable enough by itself. If trust is used to support decision-making, it is important to have not only an accurate estimate of trust, ...

متن کامل

A new trust-region algorithm based on radial basis function interpolation

Optimization using radial basis functions as an interpolation tool in trust-region (ORBIT), is a derivative-free framework based on fully linear models to solve unconstrained local optimization, especially when the function evaluations are computationally expensive. This algorithm stores the interpolation points and function values to using at subsequent iterations. Despite the comparatively ad...

متن کامل

Performance Improvement of Direct Torque Controlled Interior Permanent Magnet Synchronous Motor Drives Using Artificial Intelligence

The main theme of this paper is to present novel controller, which is a genetic based fuzzy Logic controller, for interior permanent magnet synchronous motor drives with direct torque control. A radial basis function network has been used for online tuning of the genetic based fuzzy logic controller. Initially different operating conditions are obtained based on motor dynamics incorporating...

متن کامل

A Benchmarking Algorithm to Determine Minimum Aggregation Delay for Data Gathering Trees and an Analysis of the Diameter-Aggregation Delay Tradeoff

Aggregation delay is the minimum number of time slots required to aggregate data along the edges of a data gathering tree (DG tree) spanning all the nodes in a wireless sensor network (WSN). We propose a benchmarking algorithm to determine the minimum possible aggregation delay for DG trees in a WSN. We assume the availability of a sufficient number of unique CDMA (Code Division Multiple Access...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015